A set intersection theorem and an application to a bipartite Ramsey theorem

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A stochastic Ramsey theorem

A stochastic extension of Ramsey’s theorem is established. Any Markov chain generates a filtration relative to which one may define a notion of stopping time. A stochastic colouring is any fc-valued (k < oo) colour func­ tion defined on all pairs consisting of a bounded stopping time and a finite partial history of the chain truncated before this stopping time. For any bounded stopping time 6 a...

متن کامل

An application of Ramsey theorem to stopping games

We prove that every two-player nonzero-sum deterministic stopping game with uniformly bounded payoffs admits an ε-equilibrium, for every ε > 0. The proof uses Ramsey Theorem that states that for every coloring of a complete infinite graph by finitely many colors there is a complete infinite subgraph which is monochromatic.  2002 Elsevier Science (USA). All rights reserved. JEL classification: ...

متن کامل

An Application of Ramsey ’ s Theorem to Proving Programs

We describe an application of Ramsey’s Theorem to proving programs terminate. This paper is self contained; it does not require knowledge of either field. Our account is based on two articles, one by B. Cook, Podelski, and Rybalchenko [5] and one by Podelski and Rybalchenko [19]. Many other papers that also used this application [3, 4, 18, 20, 21]. Termination checkers that have used this appli...

متن کامل

An intersection theorem for supermatroids

We generalize the matroid intersection theorem to distributive supermatroids, a structure that extends the matroid to the partially ordered ground set. Distributive supermatroids are special cases of both supermatroids and greedoids, and they generalize polymatroids. This is the first good characterization proved for the intersection problem of an independence system where the ground set is par...

متن کامل

Ramsey theorem for designs

We prove that for any choice of parameters k, t, λ the class of all finite ordered designs with parameters k, t, λ is a Ramsey class.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2002

ISSN: 0012-365X

DOI: 10.1016/s0012-365x(01)00170-4